Choice number of some complete multi-partite graphs
نویسندگان
چکیده
منابع مشابه
On the asymptotic value of the choice number of complete multi-partite graphs
We calculate the asymptotic value of the choice number of complete multi-partite graphs, given certain limitations on the relation between the sizes of the different sides. In the bipartite case, we prove that if n0 ≤ n1 and log n0 ≫ log log n1, then ch(Kn0,n1) = (1 + o(1)) log2 n1 log2 x0 , where x0 is the unique root of the equation x − 1 − x k−1 k = 0 in the interval [1,∞) and k = log2 n1 lo...
متن کاملSome Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
متن کاملOn the equitable chromatic number of complete n-partite graphs
In this note, we derive an explicit formula for the equitable chromatic number of a complete n-partite graph Kp1 ;p2 ;:::;pn . Namely, if M is the largest integer such that pi (modM)¡ ⌈pi M ⌉ (i = 1; 2; : : : ; n) then e(Kp1 ;p2 ;:::;pn) = n ∑
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملIntegral complete r-partite graphs
A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we give a useful sufficient and necessary condition for complete r-partite graphs to be integral, from which we can construct infinite many new classes of such integral graphs. It is proved that the problem of finding such integral graphs is equivalent to the problem of solving some Diophantin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00059-0